Generation of permutation sequences
نویسندگان
چکیده
منابع مشابه
Limits of permutation sequences
A permutation sequence (σn)n∈N is said to be convergent if, for every fixed permutation τ , the density of occurrences of τ in the elements of the sequence converges. We prove that such a convergent sequence has a natural limit object, namely a Lebesgue measurable function Z : [0, 1] → [0, 1] with the additional properties that, for every fixed x ∈ [0, 1], the restriction Z(x, ·) is a cumulativ...
متن کاملPermutation Generation: Two New Permutation Algorithms
Two completely new algorithms for generating permutations–shift cursor algorithm and level algorithm–and their efficient implementations are presented in this paper. One implementation of shift cursor algorithm gives an optimal solution of permutation generation problem, and one implementation of level algorithm can be used to generate random permutations.
متن کاملRule based lexicographical permutation sequences
In a permutation sequence built by means of sub permutations, the transitions between successive permutations are subject to a set of n(n – 1)/2 rules that naturally group into n – 1 matrices with a high degree of regularity. By means of these rules, the sequence can be produced in O(3n!) time and O(n) space. To generate all permutations of a given set one can go for (among other things) a mini...
متن کاملOrdering sequences by permutation transducers
To extend a natural concept of equivalence of sequences to two-sided infinite sequences, the notion of permutation transducer is introduced. Requiring the underlying automaton to be deterministic in two directions, it provides the means to rewrite bi-infinite sequences. The first steps in studying the ensuing hierarchy of equivalence classes of bi-infinite sequences are taken, by describing the...
متن کاملA new permutation choice in Halton sequences
This paper has several folds. We make first new permutation choices in Halton sequences to improve their distributions. These choices are multi-dimensional and they are made for two different discrepancies. We show that multi-dimensional choices are better for standard quasi-Monte Carlo methods. We also use these sequences as a variance reduction technique in Monte Carlo methods, which greatly ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Computer Journal
سال: 1977
ISSN: 0010-4620,1460-2067
DOI: 10.1093/comjnl/20.4.346